Resource-distribution via Boolean constraints

Resource-Distribution via Boolean Constraint (Extended Abstract)

Proof-search (the basis of logic programming) with multiplicative inference rules, such as linear logic's R and OL, is problematic because of the required non-deterministic splitting of resources. Similarly , searching with additive rules such as NL and R requires a non-deterministic choice between two formulae. Many strategies which resolve such non-determinism, either locally or globally, are...

Generating Implied Boolean Constraints Via Singleton Consistency

Though there exist some rules of thumb for design of good models for solving constraint satisfaction problems, the modeling process still belongs more to art than to science. Moreover, as new global constraints and search techniques are being developed, the modeling process is becoming even more complicated and a lot of effort and experience is required from the user. Hence (semi-) automated to...

Resour e-distribution via Boolean onstraints

Platform Based Reconfigurable Hardware Exploration via Boolean Constraints

As technology advances, the need for having reconfigurable devices becomes more of a necessity due to the growing complexity of applications. Programmable devices like Cypress Semiconductor’s Programmable System-on-a-Chip (PSoC) allow its users the flexibility to program one device that meets many of their application needs. Being that this technology is becoming more wide spread, it is now tim...

Negative Boolean Constraints

Systems of Boolean constraints which allow negative constraints such as f 6 6 g are investigated. The results form a basis for algorithms to determine satissability, validity, implication, equivalence and variable elimination for such systems. These algorithms have applications in spatial query decomposition, machine reasoning, and constraint logic programming. Proofs of the results rely on ind...